(0) Obligation:
Clauses:
p(0).
p(s(X)) :- ','(geq(X, Y), p(Y)).
geq(X, X).
geq(s(X), Y) :- geq(X, Y).
Query: p(g)
(1) PrologToPrologProblemTransformerProof (SOUND transformation)
Built Prolog problem from termination graph ICLP10.
(2) Obligation:
Clauses:
pA(T8, T8) :- pB(T8).
pA(s(T11), X18) :- pA(T11, X18).
pB(0).
pB(s(T3)) :- pA(T3, X4).
Query: pB(g)
(3) PrologToPiTRSProof (SOUND transformation)
We use the technique of [TOCL09]. With regard to the inferred argument filtering the predicates were used in the following modes:
pB_in: (b)
pA_in: (b,f)
Transforming
Prolog into the following
Term Rewriting System:
Pi-finite rewrite system:
The TRS R consists of the following rules:
pB_in_g(0) → pB_out_g(0)
pB_in_g(s(T3)) → U3_g(T3, pA_in_ga(T3, X4))
pA_in_ga(T8, T8) → U1_ga(T8, pB_in_g(T8))
U1_ga(T8, pB_out_g(T8)) → pA_out_ga(T8, T8)
pA_in_ga(s(T11), X18) → U2_ga(T11, X18, pA_in_ga(T11, X18))
U2_ga(T11, X18, pA_out_ga(T11, X18)) → pA_out_ga(s(T11), X18)
U3_g(T3, pA_out_ga(T3, X4)) → pB_out_g(s(T3))
The argument filtering Pi contains the following mapping:
pB_in_g(
x1) =
pB_in_g(
x1)
0 =
0
pB_out_g(
x1) =
pB_out_g
s(
x1) =
s(
x1)
U3_g(
x1,
x2) =
U3_g(
x2)
pA_in_ga(
x1,
x2) =
pA_in_ga(
x1)
U1_ga(
x1,
x2) =
U1_ga(
x1,
x2)
pA_out_ga(
x1,
x2) =
pA_out_ga(
x2)
U2_ga(
x1,
x2,
x3) =
U2_ga(
x3)
Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog
(4) Obligation:
Pi-finite rewrite system:
The TRS R consists of the following rules:
pB_in_g(0) → pB_out_g(0)
pB_in_g(s(T3)) → U3_g(T3, pA_in_ga(T3, X4))
pA_in_ga(T8, T8) → U1_ga(T8, pB_in_g(T8))
U1_ga(T8, pB_out_g(T8)) → pA_out_ga(T8, T8)
pA_in_ga(s(T11), X18) → U2_ga(T11, X18, pA_in_ga(T11, X18))
U2_ga(T11, X18, pA_out_ga(T11, X18)) → pA_out_ga(s(T11), X18)
U3_g(T3, pA_out_ga(T3, X4)) → pB_out_g(s(T3))
The argument filtering Pi contains the following mapping:
pB_in_g(
x1) =
pB_in_g(
x1)
0 =
0
pB_out_g(
x1) =
pB_out_g
s(
x1) =
s(
x1)
U3_g(
x1,
x2) =
U3_g(
x2)
pA_in_ga(
x1,
x2) =
pA_in_ga(
x1)
U1_ga(
x1,
x2) =
U1_ga(
x1,
x2)
pA_out_ga(
x1,
x2) =
pA_out_ga(
x2)
U2_ga(
x1,
x2,
x3) =
U2_ga(
x3)
(5) DependencyPairsProof (EQUIVALENT transformation)
Using Dependency Pairs [AG00,LOPSTR] we result in the following initial DP problem:
Pi DP problem:
The TRS P consists of the following rules:
PB_IN_G(s(T3)) → U3_G(T3, pA_in_ga(T3, X4))
PB_IN_G(s(T3)) → PA_IN_GA(T3, X4)
PA_IN_GA(T8, T8) → U1_GA(T8, pB_in_g(T8))
PA_IN_GA(T8, T8) → PB_IN_G(T8)
PA_IN_GA(s(T11), X18) → U2_GA(T11, X18, pA_in_ga(T11, X18))
PA_IN_GA(s(T11), X18) → PA_IN_GA(T11, X18)
The TRS R consists of the following rules:
pB_in_g(0) → pB_out_g(0)
pB_in_g(s(T3)) → U3_g(T3, pA_in_ga(T3, X4))
pA_in_ga(T8, T8) → U1_ga(T8, pB_in_g(T8))
U1_ga(T8, pB_out_g(T8)) → pA_out_ga(T8, T8)
pA_in_ga(s(T11), X18) → U2_ga(T11, X18, pA_in_ga(T11, X18))
U2_ga(T11, X18, pA_out_ga(T11, X18)) → pA_out_ga(s(T11), X18)
U3_g(T3, pA_out_ga(T3, X4)) → pB_out_g(s(T3))
The argument filtering Pi contains the following mapping:
pB_in_g(
x1) =
pB_in_g(
x1)
0 =
0
pB_out_g(
x1) =
pB_out_g
s(
x1) =
s(
x1)
U3_g(
x1,
x2) =
U3_g(
x2)
pA_in_ga(
x1,
x2) =
pA_in_ga(
x1)
U1_ga(
x1,
x2) =
U1_ga(
x1,
x2)
pA_out_ga(
x1,
x2) =
pA_out_ga(
x2)
U2_ga(
x1,
x2,
x3) =
U2_ga(
x3)
PB_IN_G(
x1) =
PB_IN_G(
x1)
U3_G(
x1,
x2) =
U3_G(
x2)
PA_IN_GA(
x1,
x2) =
PA_IN_GA(
x1)
U1_GA(
x1,
x2) =
U1_GA(
x1,
x2)
U2_GA(
x1,
x2,
x3) =
U2_GA(
x3)
We have to consider all (P,R,Pi)-chains
(6) Obligation:
Pi DP problem:
The TRS P consists of the following rules:
PB_IN_G(s(T3)) → U3_G(T3, pA_in_ga(T3, X4))
PB_IN_G(s(T3)) → PA_IN_GA(T3, X4)
PA_IN_GA(T8, T8) → U1_GA(T8, pB_in_g(T8))
PA_IN_GA(T8, T8) → PB_IN_G(T8)
PA_IN_GA(s(T11), X18) → U2_GA(T11, X18, pA_in_ga(T11, X18))
PA_IN_GA(s(T11), X18) → PA_IN_GA(T11, X18)
The TRS R consists of the following rules:
pB_in_g(0) → pB_out_g(0)
pB_in_g(s(T3)) → U3_g(T3, pA_in_ga(T3, X4))
pA_in_ga(T8, T8) → U1_ga(T8, pB_in_g(T8))
U1_ga(T8, pB_out_g(T8)) → pA_out_ga(T8, T8)
pA_in_ga(s(T11), X18) → U2_ga(T11, X18, pA_in_ga(T11, X18))
U2_ga(T11, X18, pA_out_ga(T11, X18)) → pA_out_ga(s(T11), X18)
U3_g(T3, pA_out_ga(T3, X4)) → pB_out_g(s(T3))
The argument filtering Pi contains the following mapping:
pB_in_g(
x1) =
pB_in_g(
x1)
0 =
0
pB_out_g(
x1) =
pB_out_g
s(
x1) =
s(
x1)
U3_g(
x1,
x2) =
U3_g(
x2)
pA_in_ga(
x1,
x2) =
pA_in_ga(
x1)
U1_ga(
x1,
x2) =
U1_ga(
x1,
x2)
pA_out_ga(
x1,
x2) =
pA_out_ga(
x2)
U2_ga(
x1,
x2,
x3) =
U2_ga(
x3)
PB_IN_G(
x1) =
PB_IN_G(
x1)
U3_G(
x1,
x2) =
U3_G(
x2)
PA_IN_GA(
x1,
x2) =
PA_IN_GA(
x1)
U1_GA(
x1,
x2) =
U1_GA(
x1,
x2)
U2_GA(
x1,
x2,
x3) =
U2_GA(
x3)
We have to consider all (P,R,Pi)-chains
(7) DependencyGraphProof (EQUIVALENT transformation)
The approximation of the Dependency Graph [LOPSTR] contains 1 SCC with 3 less nodes.
(8) Obligation:
Pi DP problem:
The TRS P consists of the following rules:
PB_IN_G(s(T3)) → PA_IN_GA(T3, X4)
PA_IN_GA(T8, T8) → PB_IN_G(T8)
PA_IN_GA(s(T11), X18) → PA_IN_GA(T11, X18)
The TRS R consists of the following rules:
pB_in_g(0) → pB_out_g(0)
pB_in_g(s(T3)) → U3_g(T3, pA_in_ga(T3, X4))
pA_in_ga(T8, T8) → U1_ga(T8, pB_in_g(T8))
U1_ga(T8, pB_out_g(T8)) → pA_out_ga(T8, T8)
pA_in_ga(s(T11), X18) → U2_ga(T11, X18, pA_in_ga(T11, X18))
U2_ga(T11, X18, pA_out_ga(T11, X18)) → pA_out_ga(s(T11), X18)
U3_g(T3, pA_out_ga(T3, X4)) → pB_out_g(s(T3))
The argument filtering Pi contains the following mapping:
pB_in_g(
x1) =
pB_in_g(
x1)
0 =
0
pB_out_g(
x1) =
pB_out_g
s(
x1) =
s(
x1)
U3_g(
x1,
x2) =
U3_g(
x2)
pA_in_ga(
x1,
x2) =
pA_in_ga(
x1)
U1_ga(
x1,
x2) =
U1_ga(
x1,
x2)
pA_out_ga(
x1,
x2) =
pA_out_ga(
x2)
U2_ga(
x1,
x2,
x3) =
U2_ga(
x3)
PB_IN_G(
x1) =
PB_IN_G(
x1)
PA_IN_GA(
x1,
x2) =
PA_IN_GA(
x1)
We have to consider all (P,R,Pi)-chains
(9) UsableRulesProof (EQUIVALENT transformation)
For (infinitary) constructor rewriting [LOPSTR] we can delete all non-usable rules from R.
(10) Obligation:
Pi DP problem:
The TRS P consists of the following rules:
PB_IN_G(s(T3)) → PA_IN_GA(T3, X4)
PA_IN_GA(T8, T8) → PB_IN_G(T8)
PA_IN_GA(s(T11), X18) → PA_IN_GA(T11, X18)
R is empty.
The argument filtering Pi contains the following mapping:
s(
x1) =
s(
x1)
PB_IN_G(
x1) =
PB_IN_G(
x1)
PA_IN_GA(
x1,
x2) =
PA_IN_GA(
x1)
We have to consider all (P,R,Pi)-chains
(11) PiDPToQDPProof (SOUND transformation)
Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi.
(12) Obligation:
Q DP problem:
The TRS P consists of the following rules:
PB_IN_G(s(T3)) → PA_IN_GA(T3)
PA_IN_GA(T8) → PB_IN_G(T8)
PA_IN_GA(s(T11)) → PA_IN_GA(T11)
R is empty.
Q is empty.
We have to consider all (P,Q,R)-chains.
(13) QDPSizeChangeProof (EQUIVALENT transformation)
By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem.
From the DPs we obtained the following set of size-change graphs:
- PA_IN_GA(T8) → PB_IN_G(T8)
The graph contains the following edges 1 >= 1
- PA_IN_GA(s(T11)) → PA_IN_GA(T11)
The graph contains the following edges 1 > 1
- PB_IN_G(s(T3)) → PA_IN_GA(T3)
The graph contains the following edges 1 > 1
(14) YES